A New Cryptosystem Based On Hidden Order Groups

Let $G_1$ be a cyclic multiplicative group of order $n$. It is known that the Diffie-Hellman problem is random self-reducible in $G_1$ with respect to a fixed generator $g$ if $\phi(n)$ is known. That is, given $g, g^x\in G_1$ and having oracle access to a `Diffie-Hellman Problem' solver with fixed generator $g$, it is possible to compute $g^{1/x} \in G_1$ in polynomial time (see theorem 3.2). On the other hand, it is not known if such a reduction exists when $\phi(n)$ is unknown (see conjuncture 3.1). We exploit this ``gap'' to construct a cryptosystem based on hidden order groups and present a practical implementation of a novel cryptographic primitive called an \emph{Oracle Strong Associative One-Way Function} (O-SAOWF). O-SAOWFs have applications in multiparty protocols. We demonstrate this by presenting a key agreement protocol for dynamic ad-hoc groups.Comment: removed examples for multiparty key agreement and join protocols, since they are redundan

Malicious Code and Spam in Wired and Wireless Environments: Problems and Solutions

Abstrac

The effects of formalized and trained non-reciprocal peer teaching on psychosocial, behavioral, pedagogical, and motor learning outcomes in physical education

Peer teaching is recognized as a powerful instructional method; however, there is a paucity of studies that have evaluated the outcomes experienced by peer-teachers and their student recipients in the context of trained, non-reciprocal, high school physical education (PE). Accordingly, the effectiveness of a formalized and trained non-reciprocal peer teaching (T-PT) program upon psychosocial, behavioral, pedagogical, and student learning outcomes within high school PE classes was investigated. Students from eight intact classes (106 males, 94 females, Mage = 12.46, SD = 0.59) were randomly assigned to either a T-PT intervention group (taught by a volunteer peer-teacher who was trained in line with a tactical games approach) or untrained group (U-PT; where volunteer peer-teachers received no formal training, but did receive guidance on the game concepts to teach). Data were collected over 10 lessons in a 5-week soccer unit. Mixed-model ANOVAs/MANOVAs revealed that, in comparison to U-PT, the T-PT program significantly enhanced in-game performance actions and academic learning time among student recipients. Those in the T-PT also provided greater levels of feedback and structured learning time, as well as reporting more positive feelings about peer teaching and fewer perceived barriers to accessing learning outcomes. These findings show that non-reciprocal peer-teachers who receive formalized support through training and tactical games approach-based teaching resources can enhance behavioral, pedagogical, and motor performance outcomes in PE

Computer Forensics: Dark Net Forensic Framework and Tools Used for Digital Evidence Detection

As the development of technology increases and its use becomes increasingly more widespread, computer crimes grow. Hence, computer forensics research is becoming more crucial in developing good forensic frameworks and digital evidence detection tools to deter more cyber-attacks. In this paper, we explore the science of computer forensics, a dark web forensic framework, and digital evidence detection tools

SimMobility Short-Term: An Integrated Microscopic Mobility Simulator

This paper presents the development of an integrated microscopic mobility simulator, SimMobility Short-Term (ST). The simulator is integrated because its models, inputs and outputs, simulated components, and code base are integrated within a multiscale agent- and activity-based simu- lation platform capable of simulating different spatiotemporal resolutions and accounting for different levels of travelers’ decision making. The simulator is microscopic because both the demand (agents and its trips) and the supply (trip realization and movements on the network) are microscopic (i.e., modeled individually). Finally, the simulator has mobility because it copes with the multimodal nature of urban networks and the need for the flexible simulation of innovative transportation ser - vices, such as on-demand and smart mobility solutions. This paper follows previous publications that describe SimMobility’s overall framework and models. SimMobility is an open-source, multiscale platform that considers land use, transportation, and mobility-sensitive behavioral models. SimMobility ST aims at simulating the high-resolution movement of agents (traffic, transit, pedestrians, and goods) and the operation of different mobility services and control and information systems. This paper presents the SimMobility ST modeling framework and system architecture and reports on its successful calibration for Singapore and its use in several scenarios of innovative mobility applications. The paper also shows how detailed performance measures from SimMobility ST can be integrated with a daily activity and mobility patterns simulator. Such integration is crucial to model accurately the effect of different technologies and service operations at the urban level, as the identity and preferences of simulated agents are maintained across temporal decision scales, ensuring the consistency and accuracy of simulated accessibility and performance measures of each scenario.Singapore. National Research Foundation (CREATE program)Singapore-MIT Alliance. Center. Future Urban Mobility Interdisciplinary Research Grou

Robustness of optimal channel reservation using handover prediction in multiservice wireless networks

The aim of our study is to obtain theoretical limits for the gain that can be expected when using handover prediction and to determine the sensitivity of the system performance against different parameters. We apply an average-reward reinforcement learning approach based on afterstates to the design of optimal admission control policies in mobile multimedia cellular networks where predictive information related to the occurrence of future handovers is available. We consider a type of predictor that labels active mobile terminals in the cell neighborhood a fixed amount of time before handovers are predicted to occur, which we call the anticipation time. The admission controller exploits this information to reserve resources efficiently. We show that there exists an optimum value for the anticipation time at which the highest performance gain is obtained. Although the optimum anticipation time depends on system parameters, we find that its value changes very little when the system parameters vary within a reasonable range. We also find that, in terms of system performance, deploying prediction is always advantageous when compared to a system without prediction, even when the system parameters are estimated with poor precision. © Springer Science+Business Media, LLC 2012.The authors would like to thank the reviewers for their valuable comments that helped to improve the quality of the paper. This work has been supported by the Spanish Ministry of Education and Science and European Comission (30% PGE, 70% FEDER) under projects TIN2008-06739-C04-02 and TIN2010-21378-C02-02 and by Comunidad de Madrid through project S-2009/TIC-1468.Martínez Bauset, J.; Giménez Guzmán, JM.; Pla, V. (2012). Robustness of optimal channel reservation using handover prediction in multiservice wireless networks. Wireless Networks. 18(6):621-633. https://doi.org/10.1007/s11276-012-0423-6S621633186Ji, S., Chen, W., Ding, X., Chen, Y., Zhao, C., & Hu, C. (2010). Potential benefits of GPS/GLONASS/GALILEO integration in an urban canyon–Hong Kong. Journal of Navigation, 63(4), 681–693.Soh, W., & Kim, H. (2006). A predictive bandwidth reservation scheme using mobile positioning and road topology information. IEEE/ACM Transactions on Networking, 14(5), 1078–1091.Kwon, H., Yang, M., Park, A., & Venkatesan, S. (2008). Handover prediction strategy for 3G-WLAN overlay networks. In Proceedings: IEEE network operations and management symposium (NOMS) (pp. 819–822).Huang, C., Shen, H., & Chuang, Y. (2010). An adaptive bandwidth reservation scheme for 4G cellular networks using flexible 2-tier cell structure. Expert Systems with Applications, 37(9), 6414–6420.Wanalertlak, W., Lee, B., Yu, C., Kim, M., Park, S., & Kim, W. (2011). Behavior-based mobility prediction for seamless handoffs in mobile wireless networks. Wireless Networks, 17(3), 645–658.Becvar, Z., Mach, P., & Simak, B. (2011). Improvement of handover prediction in mobile WiMAX by using two thresholds. Computer Networks, 55, 3759–3773.Sgora, A., & Vergados, D. (2009). Handoff prioritization and decision schemes in wireless cellular networks: a survey. IEEE Communications Surveys and Tutorials, 11(4), 57–77.Choi, S., & Shin, K. G. (2002). Adaptive bandwidth reservation and admission control in QoS-sensitive cellular networks. IEEE Transactions on Parallel and Distributed Systems, 13(9), 882–897.Ye, Z., Law, L., Krishnamurthy, S., Xu, Z., Dhirakaosal, S., Tripathi, S., & Molle, M. (2007). Predictive channel reservation for handoff prioritization in wireless cellular networks. Computer Networks, 51(3), 798–822.Abdulova, V., & Aybay, I. (2011). Predictive mobile-oriented channel reservation schemes in wireless cellular networks. Wireless Networks, 17(1), 149–166.Ramjee, R., Nagarajan, R., & Towsley, D. (1997). On optimal call admission control in cellular networks. Wireless Networks, 3(1), 29–41.Bartolini, N. (2001). Handoff and optimal channel assignment in wireless networks. Mobile Networks and Applications, 6(6), 511–524.Bartolini, N., & Chlamtac, I. (2002). Call admission control in wireless multimedia networks. In Proceedings: Personal, indoor and mobile radio communications (PIMRC) (pp. 285–289).Pla, V., & Casares-Giner, V. (2003). Optimal admission control policies in multiservice cellular networks. In Proceedings of the international network optimization conference (INOC) (pp. 466–471).Chu, K., Hung, L., & Lin, F. (2009). Adaptive channel reservation for call admission control to support prioritized soft handoff calls in a cellular CDMA system. Annals of Telecommunications, 64(11), 777–791.El-Alfy, E., & Yao, Y. (2011). Comparing a class of dynamic model-based reinforcement learning schemes for handoff prioritization in mobile communication networks. Expert Systems With Applications, 38(7), 8730–8737.Gimenez-Guzman, J. M., Martinez-Bauset, J., & Pla, V. (2007). A reinforcement learning approach for admission control in mobile multimedia networks with predictive information. IEICE Transactions on Communications , E-90B(7), 1663–1673.Sutton R., Barto A. G. (1998) Reinforcement learning: An introduction. The MIT press, Cambridge, MassachusettsBusoniu, L., Babuska, R., De Schutter, B., & Ernst, D. (2010). Reinforcement learning and dynamic programming using function approximators. Boca Raton, FL: CRC Press.Watkins, C., & Dayan, P. (1992). Q-learning. Machine learning, 8(3–4), 279–292.Brown, T. (2001). Switch packet arbitration via queue-learning. Advances in Neural Information Processing Systems, 14, 1337–1344.Proper, S., & Tadepalli, P. (2006). Scaling model-based average-reward reinforcement learning for product delivery. In Proceedings 17th European conference on machine learning (pp. 735–742).Driessens, K., Ramon, J., & Gärtner, T. (2006). Graph kernels and Gaussian processes for relational reinforcement learning. Machine Learning, 64(1), 91–119.Banerjee, B., & Stone, P. (2007). General game learning using knowledge transfer. In Proceedings 20th international joint conference on artificial intelligence (pp. 672–677).Martinez-Bauset, J., Pla, V., Garcia-Roger, D., Domenech-Benlloch, M. J., & Gimenez-Guzman, J. M. (2008). Designing admission control policies to minimize blocking/forced-termination. In G. Ming, Y. Pan & P. Fan (Eds.), Advances in wireless networks: Performance modelling, analysis and enhancement (pp. 359–390). New York: Nova Science Pub Inc.Biswas, S., & Sengupta, B. (1997). Call admissibility for multirate traffic in wireless ATM networks. In Proceedings IEEE INFOCOM (2, pp. 649–657).Evans, J. S., & Everitt, D. (1999). Effective bandwidth-based admission control for multiservice CDMA cellular networks. IEEE Transactions on Vehicular Technology, 48(1), 36–46.Gilhousen, K., Jacobs, I., Padovani, R., Viterbi, A., Weaver, L. A. J., & Wheatley, C. E., III. (1991). On the capacity of a cellular CDMA system. IEEE Transactions on Vehicular Technology, 40(2), 303–312.Hegde, N., & Altman, E. (2006). Capacity of multiservice WCDMA networks with variable GoS. Wireless Networks, 12, 241–253.Ben-Shimol, Y., Kitroser, I., & Dinitz, Y. (2006). Two-dimensional mapping for wireless OFDMA systems. IEEE Transactions on Broadcasting, 52(3), 388–396.Gao, D., Cai, J., & Ngan, K. N. (2005). Admission control in IEEE 802.11e wireless LANs. IEEE Network, 19(4), 6–13.Liu, T., Bahl, P., & Chlamtac, I. (1998). Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks. IEEE Journal on Selected Areas in Communications, 16(6), 922–936.Hu, F., & Sharma, N. (2004). Priority-determined multiclass handoff scheme with guaranteed mobile qos in wireless multimedia networks. IEEE Transactions on Vehicular Technology, 53(1), 118–135.Chan, J., & Seneviratne, A. (1999). A practical user mobility prediction algorithm for supporting adaptive QoS in wireless networks. In Proceedings IEEE international conference on networks (ICON) (pp. 104–111).Jayasuriya, A., & Asenstorfer, J. (2002). Mobility prediction model for cellular networks based on the observed traffic patterns. In Proceedings of IASTED international conference on wireless and optical communication (WOC) (pp. 386–391).Diederich, J., & Zitterbart, M. (2005). A simple and scalable handoff prioritization scheme. Computer Communications, 28(7), 773–789.Rashad, S., Kantardzic, M., & Kumar, A. (2006). User mobility oriented predictive call admission control and resource reservation for next-generation mobile networks. Journal of Parallel and Distributed Computing, 66(7), 971–988.Soh, W. -S., & Kim, H. (2003). QoS provisioning in cellular networks based on mobility prediction techniques. IEEE Communications Magazine, 41(1), 86 – 92.Lott, M., Siebert, M., Bonjour, S., vonHugo, D., & Weckerle, M. (2004). Interworking of WLAN and 3G systems. Proceedings IEE Communications, 151(5), 507 – 513.Sanabani, M., Shamala, S., Othman, M., & Zukarnain, Z. (2007). An enhanced bandwidth reservation scheme based on road topology information for QoS sensitive multimedia wireless cellular networks. In Proceedings of the 2007 international conference on computational science and its applications—Part II (ICCSA) (pp. 261–274).Mahadevan, S. (1996). Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22(1–3), 159–196.Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. New York: Wiley.Das, T. K., Gosavi, A., Mahadevan, S., & Marchalleck, N. (1999). Solving semi-markov decision problems using average reward reinforcement learning. Management Science, 45(4), 560–574.Darken, C., Chang, J., & Moody, J. (1992). Learning rate schedules for faster stochastic gradient search. In Proceedings of the IEEE-SP workshop on neural networks for signal processing II. (pp. 3–12)

Postoperative pain management in children: Guidance from the pain committee of the European Society for Paediatric Anaesthesiology (ESPA Pain Management Ladder Initiative)

The main remit of the European Society for Paediatric Anaesthesiology (ESPA) Pain Committee is to improve the quality of pain management in children. The ESPA Pain Management Ladder is a clinical practice advisory based upon expert consensus to help to ensure a basic standard of perioperative pain management for all children. Further steps are suggested to improve pain management once a basic standard has been achieved. The guidance is grouped by the type of surgical procedure and layered to suggest basic, intermediate, and advanced pain management methods. The committee members are aware that there are marked differences in financial and personal resources in different institutions and countries and also considerable variations in the availability of analgesic drugs across Europe. We recommend that the guidance should be used as a framework to guide best practice

Evidence for the h_b(1P) meson in the decay Upsilon(3S) --> pi0 h_b(1P)

Using a sample of 122 million Upsilon(3S) events recorded with the BaBar detector at the PEP-II asymmetric-energy e+e- collider at SLAC, we search for the $h_b(1P)$ spin-singlet partner of the P-wave chi_{bJ}(1P) states in the sequential decay Upsilon(3S) --> pi0 h_b(1P), h_b(1P) --> gamma eta_b(1S). We observe an excess of events above background in the distribution of the recoil mass against the pi0 at mass 9902 +/- 4(stat.) +/- 2(syst.) MeV/c^2. The width of the observed signal is consistent with experimental resolution, and its significance is 3.1sigma, including systematic uncertainties. We obtain the value (4.3 +/- 1.1(stat.) +/- 0.9(syst.)) x 10^{-4} for the product branching fraction BF(Upsilon(3S)-->pi0 h_b) x BF(h_b-->gamma eta_b).Comment: 8 pages, 4 postscript figures, submitted to Phys. Rev. D (Rapid Communications